منابع مشابه
Weakly Useful Sequences
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) weakly useful if there is a computable time bound within which all the sequences in a non-measure 0 subset of the set of decidable sequences are Turing reducible to x. Juedes, Lathrop, and Lutz (1994) proved that every we...
متن کاملWeakly Null Sequences in L1
In [MR], the second author and H. P. Rosenthal constructed the first examples of weakly null normalized sequences which do not have any unconditionally basic subsequences. Much more recently, the second author and W. T. Gowers [GM] constructed infinite dimensional Banach spaces which do not contain any unconditionally basic sequences. These later examples are of a different character than the e...
متن کاملDNA sequences useful for computation
Recent proposals for DNA based computing 1], 2], 3] encode Boolean vector component values with sequences of DNA. It has previously been assumed that suucient length random subsequences could be used to encode component values. However use of such subsequences will inadvertently result in long complementary subsequences. Complementary subsequences of suucient length would stick to each other an...
متن کاملA Note on Weakly Complete Sequences
A weakly complete sequence is an increasing sequence of positive integers with the property that every sufficiently large integer can be written as a sum of distinct terms of the sequence. In this article, we give a partial proof of a conjecture of Paul giving a formula for weakly complete sequences formed using a natural procedure.
متن کاملUnconditional Structures of Weakly Null Sequences
The following dichotomy is established for a normalized weakly null sequence in a Banach space: Either every subsequence admits a convex block subsequence equivalent to the unit vector basis of c0, or there exists a subsequence which is boundedly convexly complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2005
ISSN: 0890-5401
DOI: 10.1016/j.ic.2005.01.001